An Experimental Analysis of Possibilistic Default Reasoning

نویسندگان

  • Salem Benferhat
  • Jean-François Bonnefon
  • Rui Da Silva Neves
چکیده

This article provides an experimental analysis of the possibilistic handling of default rules. Three different nonmonotonic consequence relations are considered: minimum specificity inference (MSP), lexicographical closure (LC), and epsilon-belief functions (LCD). The latter was initially proposed within the belief function framework; it is rephrased here within a possibility theory framework. These three consequence relations share some properties but differ on others, which allows for an experimental test of their psychological plausibility. Actual human reasoning is shown to manifest properties which are similar to those of LC but not to those of MSP or LCD.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressing Independence in a Possibilistic Framework and its Application to Default Reasoning

Possibility theory offers a general framework for dealing with default rules of the form "generally, if p, then q" which are modelled by constraints expressing that having p and q true is strictly more possible than having p and not q true. Then possibilistic logic offers an inference machinery for default reasoning which obeys classical postulates for nonmonotonic reasoning including rational ...

متن کامل

COMBINING HYPOTHETICAL REASONING a n d PLAUSIBLE INFERENCE IN POSSIBILISTIC LOGIC*

Possibilistic logic provides an efficient tool for handling uncertain and nonmonotonic reasoning on the one hand, and for hypothetical reasoning on the other hand. In the first situation, logic formulas are simply weighted by lower bounds of a necessity measure. Thus, formulas in a knowledge base are rank-ordered according to their levels of certainty. In the case of hypothetical reasoning, the...

متن کامل

Coping with exceptions in multiclass ILP problems using possibilistic logic

The handling of exceptions in multiclass problems is a tricky issue in inductive logic programming (ILP). In this paper we propose a new formalization of the ILP problem which accounts for default reasoning, and is encoded with first-order possibilistic logic. We show that this formalization allows us to handle rules with exceptions, and to prevent an example to be classified in more than one c...

متن کامل

Modal logics for qualitative possibility theory

Possibilistic logic has been proposed as a numerical formalism for reasoning with uncertainty. There has been interest in developing qualitative accounts of possibility, as well as an explanation of the relationship between possibility and modal logics. We present two modal logics that can be used to represent and reason with qualitative statements of possibility and necessity. These logics hav...

متن کامل

Possibilistic Safe Beliefs vs. Possibilistic Stable Models

In any learning process, the learners arrive with a great deal of variables, such as their different learning styles, their affective states and their previous knowledge, among many others. In most cases, their previous knowledge is incomplete or it comes with a certain degree of uncertainty. Possibilistic Logic was developed as an approach to automated reasoning from uncertain or prioritized i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004